Перевод: с английского на все языки

со всех языков на английский

location polynomial

См. также в других словарях:

  • Polynomial and rational function modeling — In statistical modeling (especially process modeling), polynomial functions and rational functions are sometimes used as an empirical technique for curve fitting.Polynomial function modelsA polynomial function is one that has the form:y = a… …   Wikipedia

  • Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… …   Wikipedia

  • Alexander polynomial — In mathematics, the Alexander polynomial is a knot invariant which assigns a polynomial with integer coefficients to each knot type. James Waddell Alexander II discovered this, the first knot polynomial, in 1923. In 1969, John Conway showed a… …   Wikipedia

  • Schur polynomial — In mathematics, Schur polynomials, named after Issai Schur, are certain symmetric polynomials in n variables with integral coefficients. The elementary symmetric polynomials and the complete homogeneous symmetric polynomials are special cases of… …   Wikipedia

  • Wilkinson's polynomial — In numerical analysis, Wilkinson s polynomial is a specific polynomial which was used by James H. Wilkinson in 1963 to illustrate a difficulty when finding the root of a polynomial: the location of the roots can be very sensitive to perturbations …   Wikipedia

  • Properties of polynomial roots — In mathematics, a polynomial is a function of the form: p(x) = a 0 + a 1 x + cdots a n x^n, quad xin mathbb{C}where the coefficients a 0, ldots, a n are complex numbers. The fundamental theorem of algebrastates that polynomial p has n roots. The… …   Wikipedia

  • Ehrhart polynomial — In mathematics, a integral polytope has an associated Ehrhart polynomial which encodes the relationship between the volume of a polytope and the number of integer points the polytope contains. The theory of Ehrhart polynomials can be seen as a… …   Wikipedia

  • Zhegalkin polynomial — Zhegalkin (also Zegalkin or Gegalkine) polynomials form one of many possible representations of the operations of Boolean algebra. Introduced by the Russian mathematician I.I. Zhegalkin in 1927, they are the polynomials of ordinary high school… …   Wikipedia

  • Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …   Wikipedia

  • Discrete Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms In mathematics, the discrete Fourier transform (DFT) is a specific kind of discrete transform, used in… …   Wikipedia

  • Hilbert scheme — In algebraic geometry, a branch of mathematics, a Hilbert scheme is a scheme that is the parameter space for the closed subschemes of some projective space (or a more general scheme), refining the Chow variety. The Hilbert scheme is a disjoint… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»